Что (кто) такое balanced tree - определение

ANY NODE-BASED BINARY SEARCH TREE THAT AUTOMATICALLY KEEPS ITS HEIGHT SMALL

Balanced tree; Balanced binary search tree; Height-balanced binary search tree; Height-balanced tree; Self-balancing binary tree; Balanced binary tree; Height-balanced binary tree; SBB tree; Balanced trees; Admissible tree; Relaxed balance; Root balance; Binary self-balancing search tree

balanced tree

<algorithm> An optimisation of a tree which aims to keep equal numbers of items on each subtree of each node so as to minimise the maximum path from the root to any leaf node. As items are inserted and deleted, the tree is restructured to keep the nodes balanced and the search paths uniform. Such an algorithm is appropriate where the overheads of the reorganisation on update are outweighed by the benefits of faster search. A B-tree is a kind of balanced tree that can have more than two subtrees at each node (i.e. one that is not restricted to being a binary tree). (2000-01-10)

Weight-balanced tree

TYPE OF SELF-BALANCING BINARY SEARCH TREES THAT CAN BE USED TO IMPLEMENT DYNAMIC SETS, DICTIONARIES (MAPS) AND SEQUENCES

In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences. These trees were introduced by Nievergelt and Reingold in the 1970s as trees of bounded balance, or BB[α] trees.

https://en.wikipedia.org/wiki/Weight-balanced_tree

B-tree

A SELF-BALANCING, TREE-BASED DATA STRUCTURE, THAT ALLOWS READ/WRITE ACCESS IN LOGARITHMIC TIME

B tree; B-Tree; B-trees; B*-tree; B* tree; B-star tree; Btree; Btrees; B tree indexing; Bayer tree; B Tree; B.tree; BTree

<algorithm> A multi-way balanced tree. The "B" in B-tree has never been officially defined. It could stand for "balanced" or "Bayer", after one of the original designers of the algorithms and structure. A B-tree is _not_ (necessarily?) a "binary tree". A B+-tree (as used by IBM's VSAM) is a B-tree where the leaves are also linked sequentially, thus allowing both fast random access and sequential access to data. [Knuth's Art of Computer Programming]. [Example algorithm?] (2000-01-10)

Википедия

Self-balancing binary search tree

In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. These operations when designed for a self-balancing binary search tree, contain precautionary measures against boundlessly increasing tree height, so that these abstract data structures receive the attribute "self-balancing".

For height-balanced binary trees, the height is defined to be logarithmic $O(\log n)$ in the number $n$ of items. This is the case for many binary search trees, such as AVL trees and red–black trees. Splay trees and treaps are self-balancing but not height-balanced, as their height is not guaranteed to be logarithmic in the number of items.

Self-balancing binary search trees provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.

https://en.wikipedia.org/wiki/Self-balancing binary search tree